Smallest reactor ever

Graphs with smallest forgotten index

The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...

Programs for Ever Programs for Ever

This article reflects our experience with the preservation of computer programs that once served a scientific purpose, but were not maintained since then. After producing results, published in scientific journals in the 70’s, 80’s and begin 90’s, they were stored provisionally on some kind of persistent medium and are at present restored to current state of the art hardware. We constructed an a...

Language is never , ever , ever , random

Language users never choose words randomly, and language is essentially non-random. Statistical hypothesis testing uses a null hypothesis, which posits randomness. Hence, when we look at linguistic phenomena in corpora, the null hypothesis will never be true. Moreover, where there is enough data, we shall (almost) always be able to establish that it is not true. In corpus studies, we frequently...

Selecting the Smallest Extreme Value Population with the Smallest Variance

An Algorithm for Finding the Smallest Set of Smallest Rings

This paper describes an algorithm which finds the smallest set of smallest rings of a ring system without the necessity of finding all rings in the ring system. The algorithm first finds the smallest rings in which unused atoms occur and then progresses to find the smallest rings in which unused edges and faces occur until the smallest set of rings required to describe the complete ring system ...